// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int N=1e5+1;
int n,u,ans=0;
vector<int> G[N];
int dfs(int u)
{
	int ret=0;
	int size=G[u].size();
	for(int i=0;i<size;i++)
	{
		int v=G[u][i];
		ret=max(ret,dfs(v));
	}
	ret+=size;
	return ret;
}
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=2;i<=n;i++)
		{
			cin>>u;
			G[u].push_back(i);
		}
		ans=dfs(1);
		cout<<ans;
	}
	return 0;
}
